Uniform Randomized Self-Stabilizing Mutual Exclusion on Unidirectional Ring under Unfair C-Daemon

A distributed system consists of a set of processes and a set of communication links, each connecting a pair of processes. A distributed system is called self-stabilizing if it converges to a correct system state no matter which system state it is started with. A self-stabilizing system is considered to be an ideal fault tolerant system, since it can tolerate a nite number of transient failures. In this paper, we investigate a randomized self-stabilizing mutual exclusion system, under the assumption that the underlying communication topology of system is a unidirectional ring. It is well-known that if the number of processes (i.e., ring size) is composite, there is no deterministic system, even if c-daemon is assumed. We present a randomized self-stabilizing mutual exclusion system working under c-daemon. We allow the system to have a composite number of processes, and c-daemon to produce an unfair schedule. The system has only 4(n 1) states, where n is the number of processes.